On totally magic cordial labeling
نویسندگان
چکیده
A graph G is said to have totally magic cordial(TMC) labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0)− nf (1)| ≤ 1, where nf (i)(i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we investigate some new families of graphs that admit totally magic cordial labeling. AMS 2010 Mathematics Subject Classification. 05C78.
منابع مشابه
Totally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملSome totally modular cordial graphs
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.
متن کاملE-Cordial and Z3-Magic Labelings in Extended Triplicate Graph of a Path
In this paper we prove that the extended triplicate graph (ETG) of finite paths admits product E-cordial, total product E-cordial labelings. We show that ETG of finite paths of length n where n ∉ {4m-3|m∈N} admits E-Cordial, total E-cordial labelings and also we prove the existence of Z3 – magic labeling for the modified Extended Triplicate graph.
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملA note on 3-Prime cordial graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کامل